High Speed Radix-10 Multiplication Using Redundant BCD Codes
نویسنده
چکیده
In this paper, We propose an algorithm and architecture of a BCD parallel multiplier that exploits some properties of two different redundant BCD codes to speed up its computation. In this paper, we also develop new techniques to reduce the latency and area of previous representative high performance implementations. The Partial products are generated in parallel using a signed-digit radix-10 recoding of BCD multiplier with the digit set [-5, 5], and set of positive multiplicand multiples (0X, 1X, 2X, 3X, 4X, 5X) coded in excess-3 code(XS-3). This encoding has many advantages. First, it is self-complementing codes, so that a negative multiplicand multiple can be obtained by just inverting bits of the corresponding positive one. The available redundancy allows a fast and simple generation of multiplicand multiples in a carry free way. The partial products can be recoded to the overloaded BCD representation (ODDS) by just adding a constant factor into the partial product reduction tree. To show the advantages of our proposed architecture, we have synthesized a RTL model for 16 x 16-digit multiplications and performed a comparative survey of the existing representative designs. We show that the proposed multiplier has an area improvement roughly in the range 20-35 percent for similar target delays with respect to the fastest implementation.
منابع مشابه
Design of BCD Parrell Multiplier Using Redundant BCD Codes
We present the algorithm and architecture of a BCD parallel multiplier that exploits some properties of two different redundant BCD codes to speed up its computation: the redundant BCD excess-3 code (XS-3), and the overloaded BCD representation (ODDS). In addition, new techniques are developed to reduce significantly the latency and area of previous representative high performance implementatio...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملHigh-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier
A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).
متن کاملDesign and Synthesis of Reduced Delay BCD
Arithmetic and memory address computation are performed using adder operations. Hence, design of adders form an important subset of electronic chip design functionality. Performance of BCD adders is to be considered with gate count, area, delay, power consumption. A new BCD adder design is attempted here to reduce the delay and thereby increasing the speed of response. BCD adder design is consi...
متن کامل